Dynamic Point Location in General Subdivisions
نویسندگان
چکیده
منابع مشابه
Point Location in Dynamic Planar Subdivisions
We study the point location problem on dynamic planar subdivisions that allows insertions and deletions of edges. In our problem, the underlying graph of a subdivision is not necessarily connected. We present a data structure of linear size for such a dynamic planar subdivision that supports sublinear-time update and polylogarithmic-time query. Precisely, the amortized update time is O( √ n log...
متن کاملImproved Implementation of Point Location in General Two-Dimensional Subdivisions
We present a major revamp of the point-location data structure for general two-dimensional subdivisions via randomized incremental construction, implemented in Cgal, the Computational Geometry Algorithms Library. We can now guarantee that the constructed directed acyclic graph G is of linear size and provides logarithmic query time. Via the construction of the Voronoi diagram for a given point ...
متن کاملPoint Location in Disconnected Planar Subdivisions
Let G be a (possibly disconnected) planar subdivision and let D be a probability measure over R2. The current paper shows how to preprocess (G,D) into an O(n) size data structure that can answer planar point location queries over G. The expected query time of this data structure, for a query point drawn according to D, is O(H + 1), where H is a lower bound on the expected query time of any line...
متن کاملAdaptive Point Location in Planar Convex Subdivisions
We present a planar point location structure for a convex subdivision S. Given a query sequence of length m, the total running time is O(OPT + m log log n + n), where n is the number of vertices in S and OPT is the minimum time required by any linear decision tree for answering planar point location queries in S to process the same query sequence. The running time includes the preprocessing tim...
متن کاملComputational Geometric Learning Improved Implementation of Point Location in General Two-Dimensional Subdivisions
We present a major revamp of the point-location data structure for general two-dimensional subdivisions via randomized incremental construction, implemented in Cgal, the Computational Geometry Algorithms Library. We can now guarantee that the constructed directed acyclic graph G is of linear size and provides logarithmic query time. Via the construction of the Voronoi diagram for a given point ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1994
ISSN: 0196-6774
DOI: 10.1006/jagm.1994.1040